Mathematical Programming Society Newsletter Local Branching : Basics and Extensions 2 Prizes 6 gallimaufry 9 72

2007 Mathematical Programming Society Newsletter Prizes 2 Match , match , match , and match again 6 Peter Hammer Obituary 9 73 ISMP 2006 and Rio de Janeiro

We discuss four discrete problems, one problem for each occurrence of the word 'match' in the title of this paper. The solutions of all four problems are based on underlying matching problems.

Mathematical Programming Society Newsletter

O P T I M a Mathematical Programming Society Newsletter

A Local Branching Approach for the Set Covering Problem

The set covering problem (SCP) is a well-known combinatorial optimization problem. This paper investigates development of a local branching approach for the SCP. This solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the mixed integer programming solver. The algorithm parameters are tuned by design of experiments approach. The proposed method is te...

OPTIMA Mathematical Optimization Society Newsletter 86

July 1, 2011. For the few sorry spirits who, misguided by the general state of the world, thought that mathematical optimization was in theoretical decline or too remote from applications in the real world, the SIOPT Conference on Optimization in Darmstadt in May was a real and vivid counterexample. Indeed this very well attended meeting (600+ participants) was a resounding success in terms of ...